Local convergence of some iterative methods for generalized equations
نویسندگان
چکیده
We study generalized equations of the following form: 0 ∈ f(x) + g(x) + F (x) (∗); where f is Fréchet differentiable in a neighborhood of a solution x∗ of (*) and g is Fréchet differentiable at x∗ and where F is a set-valued map acting in Banach spaces. We prove the existence of a sequence (xk) satisfying 0 ∈ f(xk) + g(xk) + ( ∇f(xk) + [xk−1, xk; g] ) (xk+1− xk) + F (xk+1) which is super-linearly convergent to a solution of (*). We also present other versions of this iterative procedure that have superlinear and quadratic convergence, respectively.
منابع مشابه
Generalized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کاملAn accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملPreconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کاملFinite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices
A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$. An $ntimes n$ complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$). In this paper, we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...
متن کاملExistence and Iterative Approximations of Solution for Generalized Yosida Approximation Operator
In this paper, we introduce and study a generalized Yosida approximation operator associated to H(·, ·)-co-accretive operator and discuss some of its properties. Using the concept of graph convergence and resolvent operator, we establish the convergence for generalized Yosida approximation operator. Also, we show an equivalence between graph convergence for H(·, ·)-co-accretive operator and gen...
متن کاملHigh order quadrature based iterative method for approximating the solution of nonlinear equations
In this paper, weight function and composition technique is utilized to speeds up the convergence order and increase the efficiency of an existing quadrature based iterative method. This results in the proposition of its improved form from a two-point quadrature based method of convergence order ρ = 3 with efficiency index EI = 1:3161 to a three-point method of convergence order ρ = 8 with EI =...
متن کامل